Recovery of sparsest signals via ℓq-minimization

نویسنده

  • Qiyu Sun
چکیده

In this paper, it is proved that every s-sparse vector x ∈ R can be exactly recovered from the measurement vector z = Ax ∈ R via some `-minimization with 0 < q ≤ 1, as soon as each s-sparse vector x ∈ R is uniquely determined by the measurement z. Moreover it is shown that the exponent q in the `-minimization can be so chosen to be about 0.6796× (1− δ2s(A)), where δ2s(A) is the restricted isometry constant of order 2s for the measurement matrix A.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovery of sparsest signals via $\ell^q$-minimization

In this paper, it is proved that every s-sparse vector x ∈ R can be exactly recovered from the measurement vector z = Ax ∈ R via some l-minimization with 0 < q ≤ 1, as soon as each s-sparse vector x ∈ R n is uniquely determined by the measurement z.

متن کامل

Efficient ℓq Minimization Algorithms for Compressive Sensing Based on Proximity Operator

This paper considers solving the unconstrained lq-norm (0 ≤ q < 1) regularized least squares (lq-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via incorporating the proximity operator for nonconvex lq-norm functions into the fast iterative shrinkage/thresholding (FISTA) and the alternative direction method of multipliers...

متن کامل

Equivalence and Strong Equivalence between Sparsest and Least `1-Norm Nonnegative Solutions of Linear Systems and Their Application

Many practical problems can be formulated as `0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that `1-minimization is efficient for solving some classes of `0-minimization problems. From a mathematical point of view, however, the understanding of the relationship between `0and `1-mini...

متن کامل

A New Computational Method for the Sparsest Solutions to Systems of Linear Equations

The connection between the sparsest solution to an underdetermined system of linear equations and the weighted l1-minimization problem is established in this paper. We show that seeking the sparsest solution to a linear system can be transformed to searching for the densest slack variable of the dual problem of weighted l1-minimization with all possible choices of nonnegative weights. Motivated...

متن کامل

Quasi-sparsest solutions for quantized compressed sensing by graduated-non-convexity based reweighted ℓ1 minimization

In this paper, we address the problem of sparse signal recovery from scalar quantized compressed sensing measurements, via optimization. To compensate for compression losses due to dimensionality reduction and quantization, we consider a cost function that is more sparsity-inducing than the commonly used `1-norm. Besides, we enforce a quantization consistency constraint that naturally handles t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1005.0267  شماره 

صفحات  -

تاریخ انتشار 2010